HEaaN.MLIR: An Optimizing Compiler for Fast Ring-Based Homomorphic Encryption

Homomorphic encryption (HE) is an scheme that provides arithmetic operations on the encrypted data without doing decryption. For Ring-based HE, uses a polynomial ring as building blocks, performance improvement of unit HE has been achieved by two kinds efforts. The first one through accelerating operations. However, it does not facilitate optimizations across such fusing second implementing highly optimized in amalgamated manner. written codes have superior performance, but they are hard to maintain. To resolve these challenges, we propose HEaaN.MLIR, compiler performs Also, Poly and ModArith, intermediate representations (IRs) for integer modulus arrays. HEaaN.MLIR motivated manual developers do. These include optimizing modular operations, loops, vectorizing instructions. can parse program consisting ModArith instructions generate high-performance, multithreaded machine code CPU. Our experiment shows compiled outperform heavily open-source commercial libraries up 3.06x single thread 4.55x multiple threads.